Around the root of random multidimensional quadtrees
نویسندگان
چکیده
We analyse the distribution of the root pattern of randomly grown multidimensional point quadtrees. In particular, exact, recursive and asymptotic formulas are given for the expected arity of the root.
منابع مشابه
Search Costs in Quadtrees and Singularity Perturbation
Quadtrees constitute a classical data structure for storing and accessing collections of points in multidimensional space. It is proved that, in any dimension, the cost of a random search in a randomly grown quadtree has logarithmic mean and variance and is asymptotically distributed as a normal variable. The limit distribution property extends to quadtrees of all dimensions a result only known...
متن کاملSearch Costs in Quadtrees and Singularity Perturbation Asymptotics
Quadtrees constitute a classical data structure for storing and access-ing collections of points in multidimensional space. It is proved that, in any dimension, the cost of a random search in a randomly grown quadtree has logarithmic mean and variance and is asymptotically distributed as a normal variable. The limit distribution property extends to quadtrees of all dimensions a result only know...
متن کاملLimit Laws for Partial Match Queries in Quadtrees
It is proved that in an idealized uniform probabilistic model the cost of a partial match query in a multidimensional quadtree after normalization converges in distribution. The limiting distribution is given as a fixed point of a random affine operator. Also a first-order asymptotic expansion for the variance of the cost is derived and results on exponential moments are given. The analysis is ...
متن کاملA Limit Process for Partial Match Queries in Random Quadtrees and 2-d Trees by Nicolas Broutin,
We consider the problem of recovering items matching a partially specified pattern in multidimensional trees (quadtrees and k-d trees). We assume the traditional model where the data consist of independent and uniform points in the unit square. For this model, in a structure on n points, it is known that the number of nodes Cn(ξ) to visit in order to report the items matching a random query ξ ,...
متن کاملPartial match queries in random quadtrees
We propose a simple, direct approach for computing the expected cost of random partial match queries in random quadtrees. The approach gives not only an explicit expression for the leading constant in the asymptotic approximation of the expected cost but also more terms in the asymptotic expansion if desired.
متن کامل